Beyond Public Announcement Logic: An Alternative Approach to Some AI Puzzles
نویسندگان
چکیده
In the paper we present a dynamic model of knowledge. The model is inspired by public announcement logic and an approach to a puzzle concerning knowledge and communication using that logic. The model, using notions of situation and epistemic state as foundations, generalizes structures usually used as a semantics for epistemic logics in static and dynamic aspects. A computer program automatically solving the considered puzzle, implementing the model, is built.
منابع مشابه
KE Tableaux for Public Announcement Logic
Public announcement logic (PAL) is a simple dynamic epistemic logic extending reasoning about knowledge of agents with a modal operator for simultaneous and transparent knowledge updates. This logic is no more expressive than epistemic logic (EL) without updates, but exhibits compact representation of a number of complex epistemic situations. A labeled tableau proof system to reason with these ...
متن کاملAbout intuitionistic public announcement logic
Public announcement logic (PAL) is a logic for reasoning about the dynamic of knowledge in a multi-agent system in which public announcements are made. Syntactically, public announcements are modal formulas. Semantically, they correspond to restrictions of models. In [10], Ma et al. use the standard toolkit of duality theory in modal logic to define an algebraic semantics for a combination of I...
متن کاملGenerating Cellular Puzzles with Logic Programs
We show how to characterize puzzles by logic programs and how to use those characterizations to build puzzles automatically. We can control the difficulty level of the puzzles by choosing how and when to invoke the logic program.
متن کاملComments to 'logics of public communications'
This is a commentary on Jan Plaza’s ‘Logics of Public Communications’, reprinted in this same issue. Take your average publication on the dynamics of knowledge. In one of its first paragraphs you will probably encounter a phrase like “a logic of public announcements was first proposed by Plaza in 1989 (Plaza, 1989).” Tracking down this publication seems easy, because googling its title ‘Logics ...
متن کاملQuantifying over boolean announcements
Various extensions of public announcement logic have been proposed with quantification over announcements. The best-known extension is called arbitrary public announcement logic, APAL. It contains a primitive language construct ✷φ intuitively expressing that “after every public announcement of a formula, formula φ is true.” The logic APAL is undecidable and it has an infinitary axiomatization. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009